一些稀疏图的强边染色（英文）

图G的强边染色是指对图G进行正常边染色使得任意长度为3的路的三条边染不同的颜色.图G的强边色数,记为χ’_s(G),是使得图G是强k边着色的最小正整数kk.2015年,Zang [arXiv:1510.00785]证明了:最大度△(G)=5的图G,χ’_s(G)≤37.本文证明了:最大度△(G)=5且最大平均度小于8/3(或者14/5)的图G,χ’_s(G)≤13 (或者14).另外,本文证明了:最大度△(G)≥3的不含K_2,3-图子式的图G,χ’_s(G)≤4△(G)-6,这个界是紧的.     

On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph

The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph are the characteristic polynomials of its Laplacian matrix, signless Laplacian matrix and normalized Laplacian matrix, respectively. In this paper, we mainly derive six reduction procedures on the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph which can be used to construct larger Laplacian, signless Laplacian and normalized Laplacian cospectral graphs, respectively.     

关于对半层空间

利用对$g$-函数和半连续函数给出对半层空间的一些刻画, 并讨论了具有半层拓扑的拓扑序$C$-空间的对半层性.     

Radius of analyticity and exponential convergence for spectral projections of the generalized KdV equation

In this paper an exponential convergence rate for a spectral projection of the periodic initial-value problem for the generalized KdV equation is proved. Based on this convergence result, a method for determining the radius of analyticity of solutions of the generalized KdV equation is derived. Results from the new method and a similar method are compared.     

Exceptional sets in Waring-Goldbach problem for fifth powers

We consider exceptional sets in the Waring-Goldbach problem for fifth powers.For example,we prove that all but O(N^131/132)integers satisfying the necessary local conditions can be represented as the sum of 11 fifth powers of primes,which improves the previous results due to A.V.Kumchev[Canad.J.Math.,2005,57:298–327]and Z.X.Liu[Int.J.Number Theory,2012,8:1247–1256].     

亚纯函数的正规族

In this paper, we deal with the problem of normal families concerning share-values. The results extend and improve some theorems put forward by Miranda, Pang, Chen, Hua and Fang. Moreover, we answer one question posed by Gu, Pang, Fang and so on.     

Four matroidal structures of covering and their relationships with rough sets

Covering is a common form of data representation, and covering-based rough sets serve as an efficient technique to process this type of data. However, many important problems such as covering reduction in covering-based rough sets are NP-hard so that most algorithms to solve them are greedy. Matroids provide well-established platforms for greedy algorithm foundation and implementation. Therefore, it is necessary to integrate covering-based rough set with matroid. In this paper, we propose four matroidal structures of coverings and establish their relationships with rough sets. First, four different viewpoints are presented to construct these four matroidal structures of coverings, including 1-rank matroids, bigraphs, upper approximation numbers and transversals. The respective advantages of these four matroidal structures to rough sets are explored. Second, the connections among these four matroidal structures are studied. It is interesting to find that they coincide with each other. Third, a converse view is provided to induce a covering by a matroid. We study the relationship between this induction and the one from a covering to a matroid. Finally, some important concepts of covering-based rough sets, such as approximation operators, are equivalently formulated by these matroidal structures. These interesting results demonstrate the potential to combine covering-based rough sets with matroids.     

水葫芦生态系统状态反馈控制

本文研究一类以Logistic增长为基础的具有群体防御的水葫芦生态系统.首先得到无脉冲作用的系统定性结论.其次对具有状态反馈控制的脉冲系统,利用微分方程几何理论中后续函数法得到系统的阶一周期解存在的充分条件,证明该周期解是轨道渐近稳定的,同时利用数值模拟讨论了系统生态意义.